|
Jon Louis Bentley (born February 20, 1953 in Long Beach, California)〔Biography from .〕 is an American computer scientist who is credited with the heuristic based partitioning algorithm ''k''-d tree. Bentley received a B.S. in mathematical sciences from Stanford University in 1974, and M.S. and Ph.D in 1976 from the University of North Carolina at Chapel Hill; while a student, he also held internships at the Xerox Palo Alto Research Center and Stanford Linear Accelerator Center.〔 After receiving his Ph.D., he joined the faculty at Carnegie Mellon University as an assistant professor of computer science and mathematics.〔 At CMU, his students included Brian Reid, John Ousterhout, Jeff Eppinger, Joshua Bloch, and James Gosling, and he was one of Charles Leiserson's advisors. Later, Bentley moved to Bell Laboratories. He found an optimal solution for the two dimensional case of Klee's measure problem: given a set of ''n'' rectangles, find the area of their union. He and Thomas Ottmann invented the Bentley–Ottmann algorithm, an efficient algorithm for finding all intersecting pairs among a collection of line segments. He wrote the ''Programming Pearls'' column for the Communications of the ACM magazine, and later collected the articles into two books of the same name. Bentley received the Dr. Dobb's Excellence in Programming award in 2004. ==Bibliography== * ''Programming Pearls (2nd Edition)'', ISBN 0-201-65788-0. * ''More Programming Pearls: Confessions of a Coder'', ISBN 0-201-11889-0. * ''Writing Efficient Programs'', ISBN 0-13-970244-X. * ''Divide and Conquer Algorithms in Multidimensional Space'', Ph.D. thesis. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Jon Bentley」の詳細全文を読む スポンサード リンク
|